Orange Tree Fibrous Root Length Distribution in Space and Time
نویسندگان
چکیده
منابع مشابه
Newborn EEG Seizure Detection Based on Interspike Space Distribution in the Time-Frequency Domain
This paper presents a new time-frequency based EEG seizure detection method. This method uses the distribution of interspike intervals as a criterion for discriminating between seizure and nonseizure activities. To detect spikes in the EEG, the signal is mapped into the time-frequency domain. The high instantaneous energy of spikes is reflected as a localized energy in time-frequency domain. Hi...
متن کاملVertical root distribution and root cohesion of typical tree species on the Loess Plateau, China
Black locust (Robinia pseudoacacia L.) and Chinese pine (Pinus tabulaeformis Carr.) are two woody plants that are widely planted on the Loess Plateau for controlling soil erosion and land desertification. In this study, we conducted an excavation experiment in 2008 to investigate the overall vertical root distribution characteristics of black locust and Chinese pine. We also performed triaxial ...
متن کاملChildhood cancers: space-time distribution in Britain.
STUDY OBJECTIVES To examine a national data set of all childhood cancers for evidence of space-time interactions within three distinct sets of dates and places (at birth, at diagnosis, and at death), to show whether the patterns found for these events represent separate phenomena or statistically interdependent processes, and to see whether the childhood leukaemias and the childhood solid cance...
متن کاملIQPNNI: moving fast through tree space and stopping in time.
An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast algorithms to generate a list of potential candidate trees. The key ingredient is the definition of so-called important quartets (IQs), which allow the computation of an intermediate tree in O(n(2)) time for n sequences. T...
متن کاملMerkle Tree Traversal in Log Space and Time
We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log 2 (N) and space less than 3 log 2 (N), where the units of computation are hash function evaluations or leaf value computations, and the units of space are the number of node values stor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Society for Horticultural Science
سال: 2007
ISSN: 0003-1062,2327-9788
DOI: 10.21273/jashs.132.2.262